A New Approach for Constructing Low-Error, Two-Source Extractors

نویسندگان

  • Avraham Ben-Aroya
  • Eshan Chattopadhyay
  • Dean Doron
  • Xin Li
  • Amnon Ta-Shma
چکیده

Our main contribution in this paper is a new reduction from explicit two-source extractors for polynomially-small entropy rate and negligible error to explicit t-non-malleable extractors with seed-length that has a good dependence on t. Our reduction is based on the Chattopadhyay and Zuckerman framework [CZ16], and surprisingly we dispense with the use of resilient functions which appeared to be a major ingredient in [CZ16] and follow-up works. The use of resilient functions posed a fundamental barrier towards achieving negligible error, and our new reduction circumvents this bottleneck. The parameters we require from t-non-malleable extractors for our reduction to work hold (quite comfortably) in a non-explicit construction, but currently it is not known how to explicitly construct such extractors. As a result we do not give an unconditional construction of an explicit low-error two-source extractor. Nonetheless, we believe our work gives a viable approach for solving the important problem of low-error two-source extractors. Furthermore, our work highlights an existing barrier in constructing low-error two-source extractors, and draws attention to the dependence of the parameter t in the seed-length of the non-malleable extractor. We hope this work would lead to further developments in explicit constructions of both non-malleable and two-source extractors. ∗The Blavatnik School of Computer Science, Tel-Aviv University, Tel Aviv 69978, Israel. Supported by the Israel science Foundation grant no. 994/14 and by the United States – Israel Binational Science Foundation grant no. 2010120. †Cornell University and IAS. Email: [email protected]. Supported by NSF grants CCF-1526952, CCF-1412958 and the Simons Foundation. Part of this work was done when the author was a graduate student in UT Austin and while visiting the Simons Institute for the Theory of Computing at UC Berkeley. ‡The Blavatnik School of Computer Science, Tel-Aviv University, Tel Aviv 69978, Israel. Email: [email protected]. Supported by the Israel science Foundation grant no. 994/14 and by the United States – Israel Binational Science Foundation grant no. 2010120. This work was done in part while visiting the Simons Institute for the Theory of Computing at UC Berkeley. §Department of Computer Science, Johns Hopkins University, Baltimore, MD 21218, USA. Email: [email protected]. Supported by NSF Grant CCF-1617713. ¶The Blavatnik School of Computer Science, Tel-Aviv University, Tel Aviv 69978, Israel. Email: [email protected]. Supported by the Israel science Foundation grant no. 994/14 and by the United States – Israel Binational Science Foundation grant no. 2010120. This work was done in part while visiting the Simons Institute for the Theory of Computing at UC Berkeley.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-error, two-source extractors assuming efficient non-malleable extractors

We show a reduction from explicit two-source extractors with small error and arbitrarily small constant entropy rate to the existence of explicit t-non-malleable extractors with a small seed length. Previously, such a reduction was known either when one source had entropy rate above half [Raz05] or for general entropy rates but only for large error [CZ16]. As in previous reductions we start wit...

متن کامل

A reduction from efficient non-malleable extractors to low-error two-source extractors with arbitrary constant rate

We show a reduction from the existence of explicit t-non-malleable extractors with a small seed length, to the construction of explicit two-source extractors with small error for sources with arbitrarily small constant rate. Previously, such a reduction was known either when one source had entropy rate above half [Raz05] or for general entropy rates but only for large error [CZ16]. As in previo...

متن کامل

On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model

We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (CRYPTO ‘02 ), locally computable extractors directly yield secure private-key cryptosystems in Maurer’s bounded storage model (J. Cryptology, 1992). We suggest a general “sample-then-extract” approach to constructing loca...

متن کامل

New Extractors for Interleaved Sources

We study how to extract randomness from a C-interleaved source, that is, a source comprised of C independent sources whose bits or symbols are interleaved. We describe a simple approach for constructing such extractors that yields: • For some δ > 0, c > 0, explicit extractors for 2-interleaved sources on {0, 1} when one source has min-entropy at least (1 − δ)n and the other has min-entropy at l...

متن کامل

Multi-Source Randomness Extractors Against Quantum Side Information, and their Applications

We study the problem of constructing multi-source extractors in the quantum setting, which extract almost uniform random bits against an adversary who collects quantum side information from several initially independent classical random sources. This is a natural generalization of the two much studied problems of seeded randomness extraction against quantum side information, and classical indep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018